Delimited control operators prove Double-negation Shift
نویسنده
چکیده
We propose an extension of minimal intuitionistic predicate logic, based on delimited control operators, that can derive the predicate-logic version of the Double-negation Shift schema, while preserving the disjunction and existence properties.
منابع مشابه
A Direct Version of Veldman's Proof of Open Induction on Cantor Space via Delimited Control Operators
First, we reconstruct Wim Veldman’s result that Open Induction on Cantor space can be derived from Double-negation Shift and Markov’s Principle. In doing this, we notice that one has to use a countable choice axiom in the proof and that Markov’s Principle is replaceable by slightly strengthening the Double-negation Shift schema. We show that this strengthened version of Double-negation Shift ca...
متن کاملTheoretical Pearl: A simple proof of a folklore theorem about delimited control
We formalize and prove the folklore theorem that the static delimited-control operators shift and reset can be simulated in terms of the dynamic delimited-control operators control and prompt. The proof is based on small-step operational semantics.
متن کاملAn interpretation of the Sigma-2 fragment of classical Analysis in System T
We consider the Double-negation Shift (DNS) as a constructive principle in its own right and its effect on modified realizability (MR) and Dialectica (D) interpretations. We notice that DNS proves its own MR-interpretation, meaning that a priori one does not have to consider the more complex D-interpretation with Bar Recursion for interpreting Analysis. From the “with truth” variant of MR, we o...
متن کاملApplicative Bisimulations for Delimited-Control Operators
We develop a behavioral theory for the untyped call-by-value λ-calculus extended with the delimited-control operators shift and reset. For this calculus, we discuss the possible observable behaviors and we define an applicative bisimilarity that characterizes contextual equivalence. We then compare the applicative bisimilarity and the CPS equivalence, a relation on terms often used in studies o...
متن کاملThe Theory and Practice of Programming Languages with Delimited Continuations
This dissertation presents a study of functional programming languages with first-class delimited continuations. We focus mainly on theoretical and practical aspects of Danvy and Filinski’s hierarchy of static delimited-control operators shiftn and resetn, and of Felleisen’s dynamic delimited-control operators control and prompt. Our study uses the traditional means of specifying semantics of f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 163 شماره
صفحات -
تاریخ انتشار 2012